Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

plus2(x, 0) -> x
plus2(x, s1(y)) -> s1(plus2(x, y))
times2(0, y) -> 0
times2(x, 0) -> 0
times2(s1(x), y) -> plus2(times2(x, y), y)
p1(s1(s1(x))) -> s1(p1(s1(x)))
p1(s1(0)) -> 0
fac1(s1(x)) -> times2(fac1(p1(s1(x))), s1(x))

Q is empty.


↳ QTRS
  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

plus2(x, 0) -> x
plus2(x, s1(y)) -> s1(plus2(x, y))
times2(0, y) -> 0
times2(x, 0) -> 0
times2(s1(x), y) -> plus2(times2(x, y), y)
p1(s1(s1(x))) -> s1(p1(s1(x)))
p1(s1(0)) -> 0
fac1(s1(x)) -> times2(fac1(p1(s1(x))), s1(x))

Q is empty.

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

TIMES2(s1(x), y) -> PLUS2(times2(x, y), y)
P1(s1(s1(x))) -> P1(s1(x))
FAC1(s1(x)) -> P1(s1(x))
TIMES2(s1(x), y) -> TIMES2(x, y)
FAC1(s1(x)) -> TIMES2(fac1(p1(s1(x))), s1(x))
PLUS2(x, s1(y)) -> PLUS2(x, y)
FAC1(s1(x)) -> FAC1(p1(s1(x)))

The TRS R consists of the following rules:

plus2(x, 0) -> x
plus2(x, s1(y)) -> s1(plus2(x, y))
times2(0, y) -> 0
times2(x, 0) -> 0
times2(s1(x), y) -> plus2(times2(x, y), y)
p1(s1(s1(x))) -> s1(p1(s1(x)))
p1(s1(0)) -> 0
fac1(s1(x)) -> times2(fac1(p1(s1(x))), s1(x))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

TIMES2(s1(x), y) -> PLUS2(times2(x, y), y)
P1(s1(s1(x))) -> P1(s1(x))
FAC1(s1(x)) -> P1(s1(x))
TIMES2(s1(x), y) -> TIMES2(x, y)
FAC1(s1(x)) -> TIMES2(fac1(p1(s1(x))), s1(x))
PLUS2(x, s1(y)) -> PLUS2(x, y)
FAC1(s1(x)) -> FAC1(p1(s1(x)))

The TRS R consists of the following rules:

plus2(x, 0) -> x
plus2(x, s1(y)) -> s1(plus2(x, y))
times2(0, y) -> 0
times2(x, 0) -> 0
times2(s1(x), y) -> plus2(times2(x, y), y)
p1(s1(s1(x))) -> s1(p1(s1(x)))
p1(s1(0)) -> 0
fac1(s1(x)) -> times2(fac1(p1(s1(x))), s1(x))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 4 SCCs with 3 less nodes.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
            ↳ QDPOrderProof
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

P1(s1(s1(x))) -> P1(s1(x))

The TRS R consists of the following rules:

plus2(x, 0) -> x
plus2(x, s1(y)) -> s1(plus2(x, y))
times2(0, y) -> 0
times2(x, 0) -> 0
times2(s1(x), y) -> plus2(times2(x, y), y)
p1(s1(s1(x))) -> s1(p1(s1(x)))
p1(s1(0)) -> 0
fac1(s1(x)) -> times2(fac1(p1(s1(x))), s1(x))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


P1(s1(s1(x))) -> P1(s1(x))
The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial Order [17,21] with Interpretation:

POL( P1(x1) ) = x1


POL( s1(x1) ) = 2x1 + 1



The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
            ↳ QDPOrderProof
              ↳ QDP
                ↳ PisEmptyProof
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

plus2(x, 0) -> x
plus2(x, s1(y)) -> s1(plus2(x, y))
times2(0, y) -> 0
times2(x, 0) -> 0
times2(s1(x), y) -> plus2(times2(x, y), y)
p1(s1(s1(x))) -> s1(p1(s1(x)))
p1(s1(0)) -> 0
fac1(s1(x)) -> times2(fac1(p1(s1(x))), s1(x))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

PLUS2(x, s1(y)) -> PLUS2(x, y)

The TRS R consists of the following rules:

plus2(x, 0) -> x
plus2(x, s1(y)) -> s1(plus2(x, y))
times2(0, y) -> 0
times2(x, 0) -> 0
times2(s1(x), y) -> plus2(times2(x, y), y)
p1(s1(s1(x))) -> s1(p1(s1(x)))
p1(s1(0)) -> 0
fac1(s1(x)) -> times2(fac1(p1(s1(x))), s1(x))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


PLUS2(x, s1(y)) -> PLUS2(x, y)
The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial Order [17,21] with Interpretation:

POL( s1(x1) ) = 2x1 + 2


POL( PLUS2(x1, x2) ) = max{0, x1 + 2x2 - 2}



The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
              ↳ QDP
                ↳ PisEmptyProof
          ↳ QDP
          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

plus2(x, 0) -> x
plus2(x, s1(y)) -> s1(plus2(x, y))
times2(0, y) -> 0
times2(x, 0) -> 0
times2(s1(x), y) -> plus2(times2(x, y), y)
p1(s1(s1(x))) -> s1(p1(s1(x)))
p1(s1(0)) -> 0
fac1(s1(x)) -> times2(fac1(p1(s1(x))), s1(x))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

TIMES2(s1(x), y) -> TIMES2(x, y)

The TRS R consists of the following rules:

plus2(x, 0) -> x
plus2(x, s1(y)) -> s1(plus2(x, y))
times2(0, y) -> 0
times2(x, 0) -> 0
times2(s1(x), y) -> plus2(times2(x, y), y)
p1(s1(s1(x))) -> s1(p1(s1(x)))
p1(s1(0)) -> 0
fac1(s1(x)) -> times2(fac1(p1(s1(x))), s1(x))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


TIMES2(s1(x), y) -> TIMES2(x, y)
The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial Order [17,21] with Interpretation:

POL( s1(x1) ) = 2x1 + 2


POL( TIMES2(x1, x2) ) = max{0, 2x1 + x2 - 2}



The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
              ↳ QDP
                ↳ PisEmptyProof
          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

plus2(x, 0) -> x
plus2(x, s1(y)) -> s1(plus2(x, y))
times2(0, y) -> 0
times2(x, 0) -> 0
times2(s1(x), y) -> plus2(times2(x, y), y)
p1(s1(s1(x))) -> s1(p1(s1(x)))
p1(s1(0)) -> 0
fac1(s1(x)) -> times2(fac1(p1(s1(x))), s1(x))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

FAC1(s1(x)) -> FAC1(p1(s1(x)))

The TRS R consists of the following rules:

plus2(x, 0) -> x
plus2(x, s1(y)) -> s1(plus2(x, y))
times2(0, y) -> 0
times2(x, 0) -> 0
times2(s1(x), y) -> plus2(times2(x, y), y)
p1(s1(s1(x))) -> s1(p1(s1(x)))
p1(s1(0)) -> 0
fac1(s1(x)) -> times2(fac1(p1(s1(x))), s1(x))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


FAC1(s1(x)) -> FAC1(p1(s1(x)))
The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial Order [17,21] with Interpretation:

POL( 0 ) = 2


POL( s1(x1) ) = 2x1 + 1


POL( FAC1(x1) ) = x1 + 2


POL( p1(x1) ) = max{0, x1 - 1}



The following usable rules [14] were oriented:

p1(s1(s1(x))) -> s1(p1(s1(x)))
p1(s1(0)) -> 0



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
              ↳ QDP
                ↳ PisEmptyProof

Q DP problem:
P is empty.
The TRS R consists of the following rules:

plus2(x, 0) -> x
plus2(x, s1(y)) -> s1(plus2(x, y))
times2(0, y) -> 0
times2(x, 0) -> 0
times2(s1(x), y) -> plus2(times2(x, y), y)
p1(s1(s1(x))) -> s1(p1(s1(x)))
p1(s1(0)) -> 0
fac1(s1(x)) -> times2(fac1(p1(s1(x))), s1(x))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.